A Resolution Calculus for Dynamic Semantics
نویسندگان
چکیده
This paper applies resolution theorem proving to natural language semantics. The aim is to circumvent the computational complexity triggered by natural language ambiguities like pronoun binding, by interleaving pronoun binding with resolution deduction. To this end, disambiguation is only applied to expressions that actually occur during derivations. Given a set of premises and a conclusion, our resolution method only delivers pronoun bindings that are needed to derive the conclusion.
منابع مشابه
Dynamic Categorization of Semantics of Fashion Language: A Memetic Approach
Categories are not invariant. This paper attempts to explore the dynamic nature of semantic category, in particular, that of fashion language, based on the cognitive theory of Dawkins’ memetics, a new theory of cultural evolution. Semantic attributes of linguistic memes decrease or proliferate in replication and spreading, which involves a dynamic development of semantic category. More specific...
متن کاملDynamic Causal Calculus
We introduce dynamic causal calculus, a nonmonotonic formalism that can be viewed as a direct logical counterpart of the action description language C+ from (Giunchiglia et al. 2004). We formulate a nonmonotonic semantics of the associated causal language, and compare this semantics with the indirect, two-stage semantics for C+, given in (Giunchiglia et al. 2004). It will be shown, in particula...
متن کاملType Dynamic
Even in the most expressive statically-typed languages, there are always programs that will require run-time type information. An example of such a program is the eval function, whose ouput cannot be assigned a type at compile time. Abadi et al. introduce Dynamic values to solve this problem. A Dynamic value is a pair that contains a value and a type tag for that value. The authors also introdu...
متن کاملTyped Logics With States
The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a well-known result of Friedman for typed lambda calculus). This system is next extended to a full fledged typed dynamic logic, and it is illustrated how the ...
متن کاملIns - R 9703 1997
The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a well-known result of Friedman for typed lambda calculus). This system is next extended to a full edged typed dynamic logic, and it is illustrated how the re...
متن کامل